Efficient Algorithms for the Maximum Sum Problems
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for the Maximum Sum Problems
We present efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array. We deal with two MS problems; the maximum subarray (MSA) problem and the maximum convex sum (MCS) problem. In the MSA problem, we find a rectangular part within the given data array that maximizes the sum in it. The MCS problem is to find a conv...
متن کاملEfficient Algorithms for the Maximum Convex Sum Problem
his research is designed to develop and investigate newly defined problems: the Maximum Convex Sum (MCS), and its generalisation, the K-Maximum Convex Sum (K-MCS), in a two-dimensional (2D) array based on dynamic programming. The study centres on the concept of finding the most useful informative array portion as defined by different parameters involved in data, which is generically expressed i...
متن کاملEfficient heuristic algorithms for maximum utility product pricing problems
We propose improvements to some of the best heuristic algorithms for optimal product pricing problem originally designed by Dobson and Kalish in the late 1980s and in the early 1990s. Our improvements are based on a detailed study of a fundamental decoupling structure of the underlying mixed integer programming (MIP) problem and on incorporating more recent ideas, some from the theoretical comp...
متن کاملFaster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems
We present space efficient Monte Carlo algorithms that solve Subset Sum and Knapsack instances with n items using O(2) time and polynomial space, where the O∗(·) notation suppresses factors polynomial in the input size. Both algorithms assume random read-only access to random bits. Modulo this mild assumption, this resolves a long-standing open problem in exact algorithms for NP-hard problems. ...
متن کاملEfficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
Given a sequence of n real numbers A = a1, a2, . . . , an and a positive integer k, the Sum Selection Problem is to find the segment A(i, j) = ai, ai+1, . . . , aj such that the rank of the sum s(i, j) = j t=i at is k over all n(n−1) 2 segments. We present a deterministic algorithm for this problem that runs in O(n log n) time. The previously best known randomized algorithm for this problem run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2017
ISSN: 1999-4893
DOI: 10.3390/a10010005